Maximum matching in multi-interface networks

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

fault location in power distribution networks using matching algorithm

چکیده رساله/پایان نامه : تاکنون روش‏های متعددی در ارتباط با مکان یابی خطا در شبکه انتقال ارائه شده است. استفاده مستقیم از این روش‏ها در شبکه توزیع به دلایلی همچون وجود انشعاب‏های متعدد، غیر یکنواختی فیدرها (خطوط کابلی، خطوط هوایی، سطح مقطع متفاوت انشعاب ها و تنه اصلی فیدر)، نامتعادلی (عدم جابجا شدگی خطوط، بارهای تک‏فاز و سه فاز)، ثابت نبودن بار و اندازه گیری مقادیر ولتاژ و جریان فقط در ابتدای...

Multi - Interface Wireless Networks

Wireless ad hoc networks typically make use of a single radio interface on a fixed channel to communicate with neighboring nodes. Previous research has advocated the use of multiple wireless channels for enhancing the capacity of such networks. IEEE 802.11 based wireless network interfaces are capable of communicating over multiple frequency separated channels. In existing system architectures ...

متن کامل

Multi-interface Multi-channel Wireless Mesh Networks

In this thesis we propose a multi-channel wireless network based on nodes that use multiple 802.11 radio interfaces. The proposed system is singular, as it does not require new hardware or a new MAC, but instead leverages commodity 802.11-based products. With this system, we target scenarios where the nodes are stationary and where their location can often be controlled. We evaluate the perform...

متن کامل

Bandwidth Constrained Multi-interface Networks

In heterogeneous networks, devices can communicate by means of multiple wired or wireless interfaces. By switching among interfaces or by combining the available interfaces, each device might establish several connections. A connection is established when the devices at its endpoints share at least one active interface. Each interface is assumed to require an activation cost, and provides a com...

متن کامل

Cheapest Paths in Multi-interface Networks

Let G = (V, E) be a graph which models a set of wireless devices (nodes V ) that can communicate by means of multiple radio interfaces, according to proximity and common interfaces (edges E). The problem of switching on (activating) the minimum cost set of interfaces at the nodes in order to guarantee the coverage of G was recently studied. A connection is covered (activated) when the endpoints...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Theoretical Computer Science

سال: 2013

ISSN: 0304-3975

DOI: 10.1016/j.tcs.2013.01.018